A Decision Diagram Operation for Reachability

A Decision Procedure for Well-Founded Reachability

In earlier work, we introduced the logic of well-founded reachability for reasoning about linked data structures. In this paper, we present a rewriting-based decision procedure for the ground (quantifierfree) logic. We also extend the logic with restricted set constraints to allow specifications involving unbounded collections of objects. We have implemented this decision procedure within a sat...

About the Decision of Reachability for Register

Structured Reachability Analysis for Markov Decision Processes

Recent research in decision theoretic planning has focussed on making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structured reachability analysis of MDPs that are suitable when an initial state (or set of states) is known. Using compact, structured representations of MDPs (e.g., Bayesian networks), our methods, which vary in the tradeof...

A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs

Binary decision diagrams have been shown as a powerful paradigm in handling Boolean functions and have been applied to many fields such as VLSI CAD, AI, combinatorics, etc. This paper proposes a new operation on an ordered binary decision diagram (OBDD), called reordering, and demonstrates its usefulness with presenting an extended algorithmic framework of applying OBDDs to combinatorial graph ...

A Decision Support Model for Reservoir Operation

A user-friendly window based decision support model to support the reservoir operators for irrigation management is developed. Uncertainty is modeled by a data mining approach – Decision tree – in a multi stage environment, which includes different possible configurations of inflow in a wide time horizon. The aim is to identify different patterns and essential features on which to base a robust...